Direct-sum cancellation of submodule systems
نویسندگان
چکیده
منابع مشابه
Direct Sum Cancellation for Modules over One-dimensional Rings
Let R be a one-dimensional Noetherian domain with finite normalization R. In the eighties the second-named author and S. Wiegand developed a mechanism for studying the cancellation problem for finitely generated torsion-free R-modules. The key idea, described in [Wie84] and [WW87], is to represent a given torsion-free module M as a pullback: M −→ RM ↓ ↓ M/fM −→ RM/fM ∗This research was initiate...
متن کاملGeneralized Approximate Amenability of Direct Sum of Banach Algebras
In the present paper for two $mathfrak{A}$-module Banach algebras $A$ and $B$, we investigate relations between $varphi$-$mathfrak{A}$-module approximate amenability of $A$, $psi$-$mathfrak{A}$-module approximate amenability of $B$, and $varphioplus psi$-$mathfrak{A}$-module approximate amenability of $Aoplus B$ ($l^1$-direct sum of $A$ and $B$), where $varphiin$ Hom$_{mathfrak{A}}(A)$ and $psi...
متن کاملOn Direct Sum of Branches in Hyper BCK-algebras
In this paper, the notion of direct sum of branches in hks is introduced and some related properties are investigated. Applying this notion to lower hyper $BCK$-semi lattice, a necessary condition for a hi to be prime is given. Some properties of hkc are studied. It is proved that if $H$ is a hkc and $[a)$ is finite for any $ain H$, then $mid Aut(H)mid=1$.
متن کاملOn Termination of the Direct Sum of Term-Rewriting Systems
To cite this version: Michaël Rusinowitch. On termination of the direct sum of term rewriting systems. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouvert...
متن کاملMultiplicative Complexity of Direct Sum of Quadratic Systems
We consider the quadratic complexity of certain sets of quadratic forms. We study classes of direct sums of quadratic forms. For these classes of problems we show that the complexity of one direct sum is the sum of the complexities of the summands and that every minimal quadratic algorithm for computing the direct sums is a direct-sum algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1991
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90102-3